Solving efficiently Decentralized MDPs with temporal and resource constraints

Decentralized MDPs with sparse interactions

Article history: Received 26 April 2010 Received in revised form 29 April 2011 Accepted 7 May 2011 Available online 10 May 2011

Decentralized Markov Decision Processes for Handling Temporal and Resource constraints in a Multiple Robot System

We consider in this paper a multi-robot planning system where robots realize a common mission with the following characteristics : the mission is an acyclic graph of tasks with dependencies and temporal window validity. Tasks are distributed among robots which have uncertain durations and resource consumptions to achieve tasks. This class of problems can be solved by using decision-theoretic pl...

Anytime Algorithms for Solving Possibilistic MDPs and Hybrid MDPs

The ability of an agent to make quick, rational decisions in an uncertain environment is paramount for its applicability in realistic settings. Markov Decision Processes (MDP) provide such a framework, but can only model uncertainty that can be expressed as probabilities. Possibilistic counterparts of MDPs allow to model imprecise beliefs, yet they cannot accurately represent probabilistic sour...

Anytime Algorithms for Solving Possibilistic MDPs and Hybrid MDPs

Anytime Algorithms for Solving Possibilistic MDPs and Hybrid MDPs